#include<iostream>
using namespace std;

const int N=1000001;
int n;
int nums[N]={0};

void quick_sort(int q[],int l,int r)
{
	if(l>=r) return;
	int key=q[l],i=l-1,j=r+1;
	while(i<j)
	{
		do {++i;} while(q[i]<key);
		do {--j;} while(q[j]>key);
		if(i<j) swap(q[i],q[j]);
	}
	quick_sort(q,l,j);
	quick_sort(q,j+1,r);
}

int main()
{
	scanf("%d",&n);
	for(int i=0;i<n;++i)
	{
		scanf("%d",&nums[i]);
	}
	quick_sort(nums,0,n-1);
	for(int i=0;i<n;++i)
	{
		printf("%d ",nums[i]);
	}
}